SMT-Based Scheduling for Overloaded Real-Time Systems
نویسندگان
چکیده
منابع مشابه
SMT-Based Scheduling for Overloaded Real-Time Systems
In a real-time system, tasks are required to be completed before their deadlines. Under normal workload conditions, a scheduler with a proper scheduling policy can make all the tasks meet their deadlines. However, in practical environment, system workload may vary widely. Once system workload becomes too heavy, so that there does not exist a feasible schedule can make all the tasks meet their d...
متن کاملAn Incremental Server for Scheduling Overloaded Real-Time Systems
The need for supporting dynamic real-time environments where changes in workloads occur frequently requires a scheduling framework that: 1) explicitly addresses overload conditions, 2) allows the system to achieve graceful degradation while guaranteeing the deadlines of the most critical tasks in the system, and 3) supports an efficient runtime selection mechanism capable of determining the loa...
متن کاملHistory-Cognisant Time-Utility-Functions for Scheduling Overloaded Real-Time Control Systems
Time-utility functions (TUFs) as means for scheduling allow to build flexible real-time systems. TUFs yield utility values for single job executions. We extend this concept to history-cognisant utility functions (HCUFs) that assign an overall utility value to a whole task. We aim to use such HCUFs to improve the single-task performance in control systems. We present two extensions of the EDF po...
متن کاملDynamic Transaction Scheduling and Reallocation in Overloaded Real-Time Database Systems
In real-time systems it is of paramount importance that time constraints of tasks are enforced. A tremendous amount of research has been carried out on scheduling problems associated with such systems, primarily focusing on priority assignment policies in non-overloaded systems. While static real-time systems, by definition, do not suffer from overloads, they offer limited or no flexibility and...
متن کاملReal-time calculus for scheduling hard real-time systems
This paper establishes a link between three areas, namely Max-Plus Linear System Theory as used for dealing with certain classes of discrete event systems, Network Calculus for establishing time bounds in communication networks, and real-time scheduling. In particular, it is shown that important results from scheduling theory can be easily derived and unified using Max-Plus Algebra. Based on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2017
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.2016edp7374